随着大型网络在重要领域的相关领域的相关性，例如对疾病传播的联系网络的研究，或社交网络对地缘政治的影响，已经有必要研究可扩展到非常大的网络的机器学习工具，通常包含数百万节点。一种主要类别可扩展算法称为网络表示学习或网络嵌入。这些算法尝试通过首次运行多个随机散步，然后使用观察到的随机步行段中的每对节点的共同数量来学习网络功能（例如〜节点）的表示，以获得一些节点的低维表示欧几里德空间。本文的目的是严格地了解两个主要算法，深途化和Node2VEC的性能，以恢复与地面真理社区的规范网络模型的社区。根据图的稀疏性，我们发现所需的随机步道段的长度，使得相应的观察到的共生窗口能够对底层社区分配的几乎精确恢复。我们证明，考虑到一些固定的共同发生窗口，使用随机散步的Node2Vec与低横向概率的随机散步可以相比，与使用简单随机散步的深度扫视相比，稀疏网络可以成功。此外，如果稀疏参数低，我们提供了证据表明这些算法几乎完全恢复可能不会成功。该分析需要开发用于对具有底层低级结构的随机网络计数的通用工具，这与独立兴趣。

Due to the high activation sparsity and use of accumulates (AC) instead of expensive multiply-and-accumulates (MAC), neuromorphic spiking neural networks (SNNs) have emerged as a promising low-power alternative to traditional DNNs for several computer vision (CV) applications. However, most existing SNNs require multiple time steps for acceptable inference accuracy, hindering real-time deployment and increasing spiking activity and, consequently, energy consumption. Recent works proposed direct encoding that directly feeds the analog pixel values in the first layer of the SNN in order to significantly reduce the number of time steps. Although the overhead for the first layer MACs with direct encoding is negligible for deep SNNs and the CV processing is efficient using SNNs, the data transfer between the image sensors and the downstream processing costs significant bandwidth and may dominate the total energy. To mitigate this concern, we propose an in-sensor computing hardware-software co-design framework for SNNs targeting image recognition tasks. Our approach reduces the bandwidth between sensing and processing by 12-96x and the resulting total energy by 2.32x compared to traditional CV processing, with a 3.8% reduction in accuracy on ImageNet.

A framework for creating and updating digital twins for dynamical systems from a library of physics-based functions is proposed. The sparse Bayesian machine learning is used to update and derive an interpretable expression for the digital twin. Two approaches for updating the digital twin are proposed. The first approach makes use of both the input and output information from a dynamical system, whereas the second approach utilizes output-only observations to update the digital twin. Both methods use a library of candidate functions representing certain physics to infer new perturbation terms in the existing digital twin model. In both cases, the resulting expressions of updated digital twins are identical, and in addition, the epistemic uncertainties are quantified. In the first approach, the regression problem is derived from a state-space model, whereas in the latter case, the output-only information is treated as a stochastic process. The concepts of It\^o calculus and Kramers-Moyal expansion are being utilized to derive the regression equation. The performance of the proposed approaches is demonstrated using highly nonlinear dynamical systems such as the crack-degradation problem. Numerical results demonstrated in this paper almost exactly identify the correct perturbation terms along with their associated parameters in the dynamical system. The probabilistic nature of the proposed approach also helps in quantifying the uncertainties associated with updated models. The proposed approaches provide an exact and explainable description of the perturbations in digital twin models, which can be directly used for better cyber-physical integration, long-term future predictions, degradation monitoring, and model-agnostic control.

We propose a novel model agnostic data-driven reliability analysis framework for time-dependent reliability analysis. The proposed approach -- referred to as MAntRA -- combines interpretable machine learning, Bayesian statistics, and identifying stochastic dynamic equation to evaluate reliability of stochastically-excited dynamical systems for which the governing physics is \textit{apriori} unknown. A two-stage approach is adopted: in the first stage, an efficient variational Bayesian equation discovery algorithm is developed to determine the governing physics of an underlying stochastic differential equation (SDE) from measured output data. The developed algorithm is efficient and accounts for epistemic uncertainty due to limited and noisy data, and aleatoric uncertainty because of environmental effect and external excitation. In the second stage, the discovered SDE is solved using a stochastic integration scheme and the probability failure is computed. The efficacy of the proposed approach is illustrated on three numerical examples. The results obtained indicate the possible application of the proposed approach for reliability analysis of in-situ and heritage structures from on-site measurements.

This paper aims to provide an unsupervised modelling approach that allows for a more flexible representation of text embeddings. It jointly encodes the words and the paragraphs as individual matrices of arbitrary column dimension with unit Frobenius norm. The representation is also linguistically motivated with the introduction of a novel similarity metric. The proposed modelling and the novel similarity metric exploits the matrix structure of embeddings. We then go on to show that the same matrices can be reshaped into vectors of unit norm and transform our problem into an optimization problem over the spherical manifold. We exploit manifold optimization to efficiently train the matrix embeddings. We also quantitatively verify the quality of our text embeddings by showing that they demonstrate improved results in document classification, document clustering, and semantic textual similarity benchmark tests.

我们为由随机微分方程（SDE）控制的物理系统提出了一种新型的灰色盒建模算法。所提出的方法（称为深物理校正器（DPC））将用SDE代表的物理学与深神经网络（DNN）相结合。这里的主要思想是利用DNN来建模缺失的物理学。我们假设将不完整的物理与数据相结合将使模型可解释并允许更好地概括。与随机模拟器的训练替代模型相关的主要瓶颈通常与选择合适的损耗函数有关。在文献中可用的不同损失函数中，我们在DPC中使用有条件的最大平均差异（CMMD）损失函数，因为其证明了其性能。总体而言，物理数据融合和CMMD允许DPC从稀疏数据中学习。我们说明了拟议的DPC在文献中的四个基准示例上的性能。获得的结果高度准确，表明它可能将其作为随机模拟器的替代模型的应用。

为了简化图书馆管理的过程，已经采用了许多技术，但其中大多数专注于库存管理。在发行和返回图书馆的发行和返回图书馆的领域，几乎没有任何自动化进展。在大学和学校中，宿舍经常忘记及时将发行的书籍返回图书馆。为了解决上述问题并确保及时提交已发行的书籍，这项工作开发了一个解决这些复杂性的书籍机器人。该机器人可以从A点到B点通勤，扫描并验证QR码和条形码。该机器人将具有一定的有效载荷能力来携带书籍。 QR码和条形码扫描将由PI摄像头，OpenCV和Raspberry Pi启用，从而使书籍交换安全。机器人的探测器操作将通过Blynk应用程序手动控制。本文着重于如何减少人类干预，并在机器人的帮助下自动化图书馆管理系统的问题。

边缘用户的计算和通信功能有限，为大型模型的联合学习（FL）创造了重要的瓶颈。我们考虑了一个现实但较少的跨设备FL设置，在该设置中，没有客户能够培训完整的大型模型，也不愿意与服务器共享任何中间激活。为此，我们提出了主要子模型（PRISM）训练方法，该方法利用模拟低级结构和内核正交性来训练在正交内核空间中的子模型。更具体地说，通过将单数值分解（SVD）应用于服务器模型中的原始内核，Prism首先获得了一组主要的正交核，其中每个内核都通过其单数值权衡。此后，Prism利用我们的新型抽样策略，该策略独立选择主要核的不同子集以为客户创建子模型。重要的是，具有较高的采样概率分配具有较大奇异值的内核。因此，每个子模型都是整个大型模型的低级别近似值，所有客户共同实现了接近全模型的训练。我们在各种资源受限设置中对多个数据集进行的广泛评估表明，与现有替代方案相比，PRISM的性能最高可提高10％，只有20％的子模型培训。

客户的计算和通信能力有限，在资源有限的边缘节点上对联邦学习（FL）提出了重大挑战。解决此问题的一种潜在解决方案是部署现成的稀疏学习算法，该算法在每个客户端对二进制稀疏面膜进行训练，并期望训练一致的稀疏服务器掩码。但是，正如我们在本文中调查的那样，与使用密集的模型相比，这种天真的部署与FL相比，尤其是在低客户资源预算的情况下，其准确性下降了。特别是，我们的调查表明，对客户的训练有素的面具之间存在严重的共识，这阻止了服务器面罩上的收敛，并可能导致模型性能大大下降。基于这样的关键观察，我们提出了联合彩票意识到的稀疏狩猎（Flash），这是一个统一的稀疏学习框架，可以使服务器以稀疏的子模型赢得彩票，从而在高度资源有限的客户设置下可以极大地提高性能。此外，为了解决设备异质性的问题，我们利用我们的发现来提出异性恋，在此，客户可以根据其设备资源限制拥有不同的目标稀疏预算。各种数据集（IID和非IID）上有多个模型的广泛实验评估显示了我们模型的优势，最多可屈服$ \ Mathord {\ sim} 10.1 \％$ $提高精度，$ \ mathord {\ sim} 10.26 \ times与现有替代方案相比，在类似的高参数设置中，沟通成本少于$较少。

个性化响应选择系统通常基于角色。但是，角色和同理心之间存在共同关联，这些系统在这些系统中并不是很好。本文试图通过提出一套融合策略来解决这些问题，以捕捉角色，情感和话语中的综合信息之间的相互作用。关于角色chat数据集的消融研究表明，结合情绪和累积可提高响应选择的准确性。我们将融合策略和概念流编码结合在一起，以训练基于BERT的模型，该模型的表现优于原始角色的利润率大于2.3％，而修订后的角色的命中率是1.9％（前1位准确性），在角色chat数据集上实现新的最新性能。